Infinite Feature Selection: a Graph-based Feature Filtering Approach

A Graph-Based Approach to Feature Selection

Supervised Infinite Feature Selection

In this paper, we present a new feature selection method that is suitable for both unsupervised and supervised problems. We build upon the recently proposed Infinite Feature Selection (IFS) method where feature subsets of all sizes (including infinity) are considered. We extend IFS in two ways. First, we propose a supervised version of it. Second, we propose new ways of forming the feature adja...

A Hypergraph-Based Approach to Feature Selection

In many data analysis tasks, one is often confronted with the problem of selecting features from very high dimensional data. The feature selection problem is essentially a combinatorial optimization problem which is computationally expensive. To overcome this problem it is frequently assumed that either features independently influence the class variable or do so only involving pairwise feature...

A Real-Time Electroencephalography Classification in Emotion Assessment Based on Synthetic Statistical-Frequency Feature Extraction and Feature Selection

Purpose: To assess three main emotions (happy, sad and calm) by various classifiers, using appropriate feature extraction and feature selection. Materials and Methods: In this study a combination of Power Spectral Density and a series of statistical features are proposed as statistical-frequency features. Next, a feature selection method from pattern recognition (PR) Tools is presented to e...

Feature Selection on Heterogeneous Graph

Heterogeneous graph based information recommendation have been proved useful in recent studies. Given a heterogeneous graph scheme, there are many possible meta paths between the query node and the result node, and each meta path addresses a hypothesis-based ranking function. In prior researches, meta paths are manually selected by domain experts. However, when the graph scheme becomes complex,...